<pre class="docs-method-signature"><code>graph.getPredecessors(element [, opt])</code></pre><p>Return an array of all the predecessors of <code>element</code>. By default, <a href="#dia.Graph.prototype.dfs">Depth-first search algorithm</a> is used (important for the order of returned elements).
                  <br>
                  If <code>opt.breadthFirst</code> is set to <code>true</code>, use <a href="#dia.Graph.prototype.bfs">Breadth-first search algorithm</a> instead.
                  <br>
                  If <code>opt.deep</code> is set to <code>true</code>, take into account embedded elements too (see <a href="#dia.Graph.prototype.dfs">dfs()</a> for details).
                </p>